Arithmetic of Unicritical Polynomial Maps

نویسندگان

  • J. Milnor
  • JOHN MILNOR
چکیده

with derivative g b(w) = w n−1 , and use the conjugacy invariant b̂ = b . These normal forms (0.1) and (0.2) are related by the change of variable formula w = nz with b̂ = nĉ , and hence b = nc . (In particular, in the degree two case, b = b̂ is equal to 4c = 4ĉ .) If A is any ring contained in the complex numbers C , it will be convenient to use the non-standard notation A for the integral closure, the ring consisting of all complex numbers which satisfy a monic polynomial equation with coefficients in A . (See for example [AM].) Section 1 consists of statements about periodic orbits, which are proved in §2. The last section discusses the critically finite case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orbit Portraits of Unicritical Antiholomorphic Polynomials

Orbit portraits were introduced by Goldberg and Milnor as a combinatorial tool to describe the patterns of all periodic dynamical rays landing on a periodic cycle of a quadratic polynomial. This encodes information about the dynamics and the parameter spaces of these maps. We carry out a similar analysis for unicritical antiholomorphic polynomials, and give an explicit description of the orbit ...

متن کامل

Misiurewicz points for polynomial maps and transversality

The behavior under iteration of the critical points of a polynomial map plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston’s theorem tells us that fixing a particular critical point portrait and degree leads to only finitely many possible polynomials (up to equivalence) and that, in many cases, th...

متن کامل

Local Connectivity of Julia Sets

We prove that the Julia set J(f) of at most finitely renormalizable unicritical polynomial f : z 7→ z + c with all periodic points repelling is locally connected. (For d = 2 it was proved by Yoccoz around 1990.) It follows from a priori bounds in a modified Principle Nest of puzzle pieces. The proof of a priori bounds makes use of new analytic tools developed in [KL] that give control of moduli...

متن کامل

Combinatorial Rigidity for Unicritical Polynomials

We prove that any unicritical polynomial fc : z 7→ z+c which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the “Multibrot set”) is locally connected at the corresponding parameter values. It generalizes Yoccoz’s Theorem for quadratics to the higher degree case. Stony Brook IMS Preprint #2005/05 July 2005

متن کامل

The Dynamical André-oort Conjecture: Unicritical Polynomials

We establish the equidistribution with respect to the bifurcation measure of postcritically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial analysis of certain algebraic correspondences on the complement of the Mandelbrot set M2 (or generalized Mandelbrot set Md for degree d > 2), we classify all c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012